Randomness extraction in finite fields F_{p^n}
نویسندگان
چکیده
منابع مشابه
Randomness Extraction in finite fields Fpn
Many technics for randomness extraction over finite fields was proposed by various authors such as Fouque et al. and Carneti et al.. At eurocrypt’09, these previous works was improved by Chevalier et al., over a finite field Fp, where p is a prime. But their papers don’t study the case where the field is not prime such as binary fields. In this paper, we present a deterministic extractor for a ...
متن کاملMulti-sources Randomness Extraction over Finite Fields and Elliptic Curve
This work is based on the proposal of a deterministic randomness extractor of a random Diffie-Hellman element defined over two prime order multiplicative subgroups of a finite fields Fpn , G1 and G2. We show that the least significant bits of a random element in G1 ∗G2, are indistinguishable from a uniform bit-string of the same length. One of the main application of this extractor is to replac...
متن کاملOn Randomness Extraction in AC0
We consider randomness extraction by AC circuits. The main parameter, n, is the length of the source, and all other parameters are functions of it. The additional extraction parameters are the min-entropy bound k = k(n), the seed length r = r(n), the output length m = m(n), and the (output) deviation bound = (n). For k ≤ n/ log n, we show that AC-extraction is possible if and only if mr ≤ 1 + p...
متن کاملKey Derivation and Randomness Extraction
Key derivation refers to the process by which an agreed upon large random number, often named master secret, is used to derive keys to encrypt and authenticate data. Practitioners and standardization bodies have usually used the random oracle model to get key material from a Diffie-Hellman key exchange. However, proofs in the standard model require randomness extractors to formally extract the ...
متن کاملLinear Transformations for Randomness Extraction
Information-efficient approaches for extracting randomness from imperfect sources have been extensively studied, but simpler and faster ones are required in the high-speed applications of random number generation. In this paper, we focus on linear constructions, namely, applying linear transformation for randomness extraction. We show that linear transformations based on sparse random matrices ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Algebra
سال: 2013
ISSN: 1314-7595
DOI: 10.12988/ija.2013.2566